On the partial realization problem
نویسندگان
چکیده
We consider here a two sided interpolation problem where we want to minimize the degree of the interpolant. We show that this degree is given by the rank of a particular solution to a Sylvester equation which, in some particular cases becomes a Löwner or a Hankel matrix. We consider an application to the usual partial realization problem. The results are quite general and no particular assumption on the location of the interpolating nodes are needed.
منابع مشابه
On the Partial Stochastic Realization Problem*
In this paper we describe a complete parameterization of the solutions to the partial stochastic realization problem in terms of a nonstandard matrix Riccati equation. Our analysis of this Covariance Extension Equation is based on a recent complete parameterization of all strictly positive real solutions to the rational covariance extension problem, answering a conjecture due to Georgiou in the...
متن کاملAn algebraic description of realizations of partial covariance sequences
The solutions of the partial realization problem have to satisfy a finite number of interpolation conditions at 1. The minimal degree of an interpolating deterministic system is called the algebraic degree or McMillan degree of the partial covariance sequence and is easy to compute. The solutions of the partial stochastic realization problem have to satisfy the same interpolation conditions and...
متن کاملPartial realization of descriptor systems
We address the partial realization problem for linear descriptor systems. A general solution to this problem using the Markov parameters of the system defined via its Laurent series is provided. For proper descriptor systems, we also discuss a numerically feasible algorithm for computing a partial minimal realization based on the unsymmetric Lanczos process. Applications to model reduction for ...
متن کاملModeling of Partial Digest Problem as a Network flows problem
Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...
متن کاملOn partial realization and interpolation of models from orthogonal basis function expansions∗
In this paper we address the problem of computing a minimal state-space realization from partial knowledge of an expansion in terms of generalized rational orthogonal basis functions. The basis functions considered are generated by stable all-pass £lters. It is shown how a minimal state-space realization can be found on the basis of complete knowledge of the expansion coef£cients. Subsequently ...
متن کاملRecent Progress on the Partial Stochastic Realization Problem
In view of Paul Fuhrmann’s many important contributions to realization theory, it seems quite appropriate to devote this lecture to the stochastic partial realization problem, when today we are honoring him on his 60th birthday. Some ten years ago Christopher I. Byrnes and I launched a joint research program on this topic, and by now we have some results which I think might interest this audien...
متن کامل